Location:
Search - maximum paths
Search list
Description: 输入任意大小的矩阵阶数n，程序将自动产生一个随机矩阵迷宫。本程序可以迅速的找到所有可能的路径，并显示之。代码中故意限制只显示最多30条路径。-arbitrary size of the input matrix order n, the program will automatically generate a random matrix maze. This program can quickly find all possible paths, and Displays. Code intentionally limited only to a maximum of 30 trails.
Platform: |
Size: 11367 |
Author: aaaa |
Hits:
Description: 输入任意大小的矩阵阶数n，程序将自动产生一个随机矩阵迷宫。本程序可以迅速的找到所有可能的路径，并显示之。代码中故意限制只显示最多30条路径。-arbitrary size of the input matrix order n, the program will automatically generate a random matrix maze. This program can quickly find all possible paths, and Displays. Code intentionally limited only to a maximum of 30 trails.
Platform: |
Size: 11264 |
Author: aaaa |
Hits:
Description: 作者Andrew V. Godberg
本文介绍一种解决网络最大流问题的算法。-Abstract. All previously known efftcient maximum-flow algorithms work by finding augmenting paths,
either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortest-length
augmenting paths at once (using the layered network approach of Dinic).
Platform: |
Size: 1408000 |
Author: waterrenny |
Hits:
Description: 利用 FPGA 实现大型设计时，可能需要FPGA 具有以多个时钟运行的多重数据通路，这种
多时钟FPGA 设计必须特别小心，需要注意最大时钟速率、抖动、最大时钟数、异步时钟
设计和时钟/数据关系。设计过程中最重要的一步是确定要用多少个不同的时钟，以及如何
进行布线，本文将对这些设计策略深入阐述。-Using FPGA to achieve large-scale design, may need to run the FPGA with multiple clocks to multiple data paths, multiple clock FPGA design that must be especially careful to note the maximum clock rate, jitter, maximum number of clocks, asynchronous clock design and clock/data relationship. The design of the most important step is to determine how many different clocks to use, and how to layout, this paper will further elaborate the design strategy.
Platform: |
Size: 174080 |
Author: 张小琛 |
Hits:
Description: 最短增量路径算法，先找到从第源点到汇聚点的所有路径(生成树)，然后再依次找出每条路径的最大流量并同时修改矩阵的流量减该路径的最大流量，最后相加每条路径的流量得到总的最大流量-Incremental shortest path algorithm, first find from the source to a focal point of all paths (MST), and then turn to find the maximum flow of each path and also change the flow matrix by the maximum flow of the path, the final sum The total flow of each path are the maximum flow
Platform: |
Size: 1024 |
Author: kbz |
Hits:
Description: 实现一个简单的shell，实现步骤：（1）在虚拟的shell界面上出现命令提示符（$或＃）；
（2）获取用户指令：获取用户在命令提示符后面输入的命令及其参数，并注意命令输入的最大长度；
（3）解析指令：对用户输入的命令进行解析，解析出命令名和参数；
（4）寻找命令文件：每个命令的执行都必须依靠对应的可执行文件，这些文件的存放路径存放在用户的PATH环境变量里；
（5）执行命令：可通过fork( )系统调用创建一个进程来完成执行命令的任务，具体的命令执行用execv( )函数。
-
Implement a simple shell, implementation steps: (1) appears on the virtual shell interface command prompt ($ or#) (2) to obtain user instructions: Get the user at the command prompt type the command and its parameters, and Note that the maximum length of command input (3) resolve command: the command to parse user input, parse out the command name and parameters (4) to find the command file: Each command must rely on the implementation of the corresponding executable files storage paths stored in the user s PATH environment variable (5) execute the command: by fork () system call to create a process to execute the command to complete the task, the specific command with execv () function.
Platform: |
Size: 1024 |
Author: 包伟伟 |
Hits:
Description: This application note describes the implementation of SERDES Framer Interface Level 5
(SFI-5) [Ref 1] in a Virtex-6 XC6VLX240T FPGA. SFI-5 is a standard defined by the Optical
Internetworking Forum (OIF). The interface must operate bidirectionally at a payload data rate
of 40 Gb/s with 0–25 forward error correction (FEC) overhead, up to a maximum of 50 Gb/s.
The interface consists of 17 bidirectional GTX transceivers and logic to compensate skew
differences between the transmission paths of the data channels.-This application note describes the implementation of SERDES Framer Interface Level 5
(SFI-5) [Ref 1] in a Virtex-6 XC6VLX240T FPGA. SFI-5 is a standard defined by the Optical
Internetworking Forum (OIF). The interface must operate bidirectionally at a payload data rate
of 40 Gb/s with 0–25 forward error correction (FEC) overhead, up to a maximum of 50 Gb/s.
The interface consists of 17 bidirectional GTX transceivers and logic to compensate skew
differences between the transmission paths of the data channels.
Platform: |
Size: 1026048 |
Author: ylt_9811115 |
Hits:
Description: 测地线又名 测地线又称大地线或短程线，可以定义为空间中两点的局域最短或最长路径。测地线(geodesic)的名字来自于对于地球尺寸与形状的大地测量学(geodesy)。-Aka geodesic geodesic lines or short lines, also known as the earth, the space can be defined as the local minimum or maximum two paths. Geodesic (geodesic) takes its name from the shape of the Earth s size and Geodesy (geodesy).
Platform: |
Size: 147456 |
Author: 郭郭 |
Hits:
Description: 无环连通图G=(V, E)亦称为自由树T，其直径是树中所有顶点之间最短路径的最大值，设计一个算法求T的直径-Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T
Platform: |
Size: 3701760 |
Author: Anita |
Hits:
Description: The algorithm developed by Eppstein not looking for simple paths. In
Indeed, the paths returned by the algorithm may contain rings or
loops. It applies only on graphs where the weights are positive.
This algorithm is based on extensive use of heap. These piles will allow
construct a graph of P such that the maximum level is 4 and a path
in P corresponds to a path in the starting graph.
A Python script (ksp.py) is provided in order to test both algorithms
directly the command line. The parameters are the file name
containing the graph, the origin of the roads, the roads end and the number
paths. It should also add the -a option followed by the choice of algorithm
(Eppstein or yen). Two additional optional parameters have been added:
-s which saves the graph in an image whose name is passed
-p parameter and that saves the graph P generated Eppstein algorithm.
Both options require Graphviz to generate images and the
library PyGraphviz-The algorithm developed by Eppstein not looking for simple paths. In
Indeed, the paths returned by the algorithm may contain rings or
loops. It applies only on graphs where the weights are positive.
This algorithm is based on extensive use of heap. These piles will allow
construct a graph of P such that the maximum level is 4 and a path
in P corresponds to a path in the starting graph.
A Python script (ksp.py) is provided in order to test both algorithms
directly the command line. The parameters are the file name
containing the graph, the origin of the roads, the roads end and the number
paths. It should also add the -a option followed by the choice of algorithm
(Eppstein or yen). Two additional optional parameters have been added:
-s which saves the graph in an image whose name is passed
-p parameter and that saves the graph P generated Eppstein algorithm.
Both options require Graphviz to generate images and the
library PyGraphviz
Platform: |
Size: 1269760 |
Author: bright |
Hits: